Arrow's Theorem Through a Fixpoint Argument
نویسندگان
چکیده
منابع مشابه
Dice games and Arrows theorem
We observe that non-transitivity is not the most general way that Arrows impossibility theorem is reected in dice games. Non-transitivity in dice games is a well-known phenomenon. It was described in several Scienti c American columns in the 1970s, beginning with [3], and has since become a popular topic, discussed in articles like [4, 5] and textbooks on elementary mathematics and probabilit...
متن کاملA Lattice-theoretical Fixpoint Theorem and Its Applications
1. A lattice-theoretical fixpoint theorem. In this section we formulate and prove an elementary fixpoint theorem which holds in arbitrary complete lattices. In the following sections we give various applications (and extensions) of this result in the theories of simply ordered sets, real functions, Boolean algebras, as well as in general set theory and topology. * By a lattice we understand as ...
متن کاملA Formal Frobenius Theorem and Argument Shift
A formal Frobenius theorem, which is an analog of the classical integrability theorem for smooth distributions, is proved and applied to generalize the argument shift method of A. S. Mishchenko and A. T. Fomenko to finite-dimensional Lie algebras over any field of characteristic zero. A completeness criterion for a commutative set of polynomials constructed by the formal argument shift method i...
متن کاملPrecise Fixpoint Computation Through Strategy Iteration
We present a practical algorithm for computing least solutions of systems of equations over the integers with addition, multiplication with positive constants, maximum and minimum. The algorithm is based on strategy iteration. Its run-time (w.r.t. the uniform cost measure) is independent of the sizes of occurring numbers. We apply our technique to solve systems of interval equations. In particu...
متن کاملFixpoint Theorem for Continuous Functions on Chain-Complete Posets
Let P be a non empty poset. Observe that there exists a chain of P which is non empty. Let I1 be a relational structure. We say that I1 is chain-complete if and only if: (Def. 1) I1 is lower-bounded and for every chain L of I1 such that L is non empty holds sup L exists in I1. One can prove the following proposition (1) Let P1, P2 be non empty posets, K be a non empty chain of P1, and h be a mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.297.12